Scheduling activities with time-dependent durations and resource consumptions

In this paper we study the problem of scheduling a given sequence activities where each activity consumes resource with limited availability. Activity durations as well consumptions are assumed to be time-dependent. Because interaction time-dependent and consumptions, policies based on starting in early possible may fail due unnecessarily high exceeding availability resource. We propose dynamic discretization discovery algorithm that generates partially time-expanded network during search. an acceleration technique allowing significantly reduce computational effort if approach is embedded iterative solution procedure frequently evaluates sequences which start same activities. Furthermore, extend our case resources can replenished between subsequent evaluate route evaluation method for routing fleet electric vehicles travel energy consumed when travelling from one location another depend time day.